How to implement Statecharts intuitionistically

To the best of our knowledge, this is the first work to present an implementation of Lüttgen and Mendler’s intuitionistic characterisation of Pnueli and Shalev’s step construction. However, the original step construction is faster for most Statecharts, because a non-compositional approach will almost always outperform any compositional one. For incremental code-generation or compositional verification, compositionality is crucial and hence a compositional implementation is required. The next step should be the utilisation of propositional decision procedures instead of BDDs. To compare Pnueli and Shalev’s step construction and Lüttgen and Mendler’s intuitionistic approach on real Statecharts, we have implemented both in C++. The performance was judged using a test suite of different Statecharts. For usual Statecharts Pnueli and Shalev’s step construction was significantly faster than the intuitionistic approach via BDDs. However, for Statecharts with an exponential number of responses it revealed that Lüttgen and Mendler’s approach outperforms the original step construction procedure substantially. Pnueli and Shalev’s Original Step Construction First implementation of Lüttgen and Mendler’s Intuitionistic Semantics